Semantic Analysis of Shared - Memory Concurrent

In this article we present a true-concurrent operational semantics of a Pascal-like language with a parallel operator and shared memory. This semantics is based on a higher-dimensional transition system that is able to model the asyn-chronous execution of concurrent operations. We show how it can be usefully abstracted to nite automata via abstract interpretation using folding of states and appropriate widening operators. Then we compute static properties relevant to the standard concurrent execution of the program by means of model-checking on the abstract automata that were previously derived ; for instance, approximations of the values of shared variables and temporal properties about standard execution paths can be obtained eeectively with a high degree of accuracy .